Bialgebraic Modelling of Timed Processes
نویسنده
چکیده
We give an abstract axiomatic account of timed processes using monoids and their (partial and total) actions. Subsequently, we present categorical formulations thereof, including a novel characterisation of partial monoid actions as coalgebras for an evolution comonad. Adapting the approach of Turi and Plotkin [24], we then exhibit an abstract theory of well-behaved operational rules suitable for timed processes and, for discrete time, also derive a concrete syntactic format encompassing all rules we found in the literature.
منابع مشابه
Processes of timed Petri nets
Processes of timed Petri nets are represented by labelled partial orders with some extra features. These features reflect the execution times of processes and allow to combine processes sequentially and in parallel, which leads to some algebras. The processes can be represented either without specifying when particular situations appear (free processes), or together with the respective appearan...
متن کاملModelling Timed Concurrent Systems Using Activity Diagram Patterns
UML is the de facto standard for modelling concurrent systems in the industry. Activity diagrams allow designers to model workflows or business processes. Unfortunately, their informal semantics prevents the use of automated verification techniques. In this paper, we first propose activity diagram patterns for modelling timed concurrent systems; we then devise a modular mechanism to compose tim...
متن کاملBialgebraic Methods in Structural Operational Semantics: Invited Talk
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of algebraic and coalgebraic methods, it abstracts from concrete notions of syntax and system behaviour, thus treating various kinds of operational descriptions in a uniform fashion. In this talk, the current state of the art...
متن کاملIntroducing monitoring events to timed-CSP
Timed-CSP is a process algebra designed to help in the modelling and analysis of real-time concurrent systems. Timed-CSP can handle synchronisation events that require the cooperation of all the interested parties and broadcasting events which do not require any cooperation from the environment. This paper argues that, still, there are scenarios that can not be adequately modelled in Timed-CSP ...
متن کاملM–timed Petri Nets, Priorities, Preemptions, and Performance Evaluation of Systems
In M–timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M–timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict–free nets can model M and Ek–type queueing systems. Free—choice nets can also represent Hk–type systems. Systems with several classes of users an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002